Was Pauling Mistaken about Metals?

Pauling described metallic bonds using resonance. The maximum probability domains in the Kronig–Penney model can show a picture of it. When the walls are opaque (and the band gap is large) the maximum probability domain for an electron pair essentially corresponds to the region between the walls: the electron pairs are localized within two consecutive walls. However, when the walls become transparent (and the band gaps closes), the maximum probability domain can be moved through the system without a significant loss in probability.     

Nonrigid image registration using similarity measure based on spatially weighted global probability distribution function

In nonrigid image registration, similarity measures including spatial information have been shown to perform better than those measures without spatial information. In this work, we provide new insight to the relationships among regional mutual information, regional probability distribution functions (PDFs) and global PDFs, and propose a novel nonrigid registration scheme with spatially weighted global probability distribution function (SWGPDF). Similarity measures based on SWGPDF (SWGPDFSM) are constructed. Three different spatial sub-region division methods are compared: the equally spaced sub-region (ESSR), the local binary pattern sub-region (LBPSR) and the gradient sub-region (GSR). The registration scheme applies B-spline based free form deformations (FFDs) as the transformation model. A Parzen window and linear interpolation are used to construct histograms. The SWGPDFSM registration scheme with ESSR space division is compared with the traditional global mutual information (gMI), the traditional global normalized mutual information (gNMI), regional mutual information and the SWGPDFSM with LBPSR or GSR space division. The test results show that SWGPDFSM scheme with ESSR space division outperforms the other schemes for elastically aligning images in the presence of big geometrical transformations, bias fields and illumination changes.     

Perfect controlled joint remote state preparation independent of entanglement degree of the quantum channel

We construct a quantum circuit to produce a task-oriented partially entangled state and use it as the quantum channel for controlled joint remote state preparation. Unlike most previous works, where the parameters of the quantum channel are given to the receiver who can accomplish the task only probabilistically by consuming auxiliary resource, operation and measurement, here we give them to the supervisor. Thanks to the knowledge of the task-oriented quantum channel parameters, the supervisor can carry out proper complete projective measurement, which, combined with the feed-forward technique adapted by the preparers, not only much economizes (simplifies) the receiver's resource (operation) but also yields unit total success probability. Notably, such apparent perfection does not depend on the entanglement degree of the shared quantum channel. Our protocol is within the reach of current quantum technologies.     

A method of segment protection based on p-cycle for dynamic multicast with limited-range wavelength converter in WDM network

In the optical multicast network, node and link failures have very important influence on the network survivability which may lead to multiple destinations cannot receive data. Based on the wavelength layered-graph method, a method of efficiency-score based on heuristic algorithm of pre-configured cycle (p-Cycle) based-segment protection (ESHS) for dynamic multicast with limited-range wavelength conversion was presented in this paper. By finding the multicast tree segment protection, the total available p-Cycles are constructed for the multicast. Then we calculate each p-Cycle efficiency-score, the highest efficient-score p-Cycle is selected as the multicast route protection p-Cycle. The simulation results show that the ESHS can get higher performance than the existing ESHT algorithm, in terms of multicast request blocking probability and wavelength utilization.     

The survival probability of critical and subcritical branching processes in finite state space Markovian environment

Let ${\left(Z_n\right)}_{n\ge 0}$ be a branching process in a random environment defined by a Markov chain ${\left(X_n\right)}_{n\ge 0}$ with values in a finite state space $\mathbb{X}$. Let ${\mathbb{P}}_i$ be the probability law generated by the trajectories of ${\left(X_n\right)}_{n\ge 0}$ starting at $X_0=i\in \mathbb{X}.$ We study the asymptotic behaviour of the joint survival probability ${\mathbb{P}}_i\left(Z_n>0,X_n=j\right)$, $j\in \mathbb{X}$ as $n\to +\infty$ in the critical and strongly, intermediate and weakly subcritical cases.     

Persistence of sums of correlated increments and clustering in cellular automata

Let $T$ be the first return time to $(?\infty ,0]$ of sums of increments given by a functional of a stationary Markov chain. We determine the asymptotic behavior of the survival probability, $\mathbb{P}(T\ge t)～C{t}^{?1∕2}$ for an explicit constant $C$. Our analysis is based on a connection between the survival probability and the running maximum of the time-reversed process, and relies on a functional central limit theorem for Markov chains. As applications, we recover known clustering results for the 3-color cyclic cellular automaton and the Greenberg–Hastings model, and we prove a new clustering result for the 3-color firefly cellular automaton.     

一类改进最大熵方法的可调参数分析

在结构可靠性分析中,引入含可调参数的转换函数能对传统的最大熵方法进行改进,获得更高的失效概率预测精度。但是,此可调参数的最佳取值很难确定。针对这一问题,引入概率守恒方程,从功能函数转换前后所得概率密度函数出发,建立其最大熵值的变化关系,给出转换前后最大熵值之差的理论形式。通过对三种典型单调非线性转换函数开展算例研究,发现功能函数转换前后的最大熵值之差与转换函数的最佳可调参数值有关。改变可调参数值驱使最大熵值之差变化的同时,改进最大熵方法能遍历到更好的失效概率估计值。     

Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks

This paper considers the problem of learning multinomial distributions from a sample of independent observations. The Bayesian approach usually assumes a prior Dirichlet distribution about the probabilities of the different possible values. However, there is no consensus on the parameters of this Dirichlet distribution. Here, it will be shown that this is not a simple problem, providing examples in which different selection criteria are reasonable. To solve it the Imprecise Dirichlet Model (IDM) was introduced. But this model has important drawbacks, as the problems associated to learning from indirect observations. As an alternative approach, the Imprecise Sample Size Dirichlet Model (ISSDM) is introduced and its properties are studied. The prior distribution over the parameters of a multinomial distribution is the basis to learn Bayesian networks using Bayesian scores. Here, we will show that the ISSDM can be used to learn imprecise Bayesian networks, also called credal networks when all the distributions share a common graphical structure. Some experiments are reported on the use of the ISSDM to learn the structure of a graphical model and to build supervised classifiers.     

Reliability analysis of a single warm-standby system subject to repairable and nonrepairable failures

An n-unit system provisioned with a single warm standby is investigated. The individual units are subject to repairable failures, while the entire system is subject to a nonrepairable failure at some finite but random time in the future. System performance measures for systems observed over a time interval of random duration are introduced. Two models to compute these system performance measures, one employing a policy of block replacement, and the other without a block replacement policy, are developed. Distributional assumptions involving distributions of phase type introduce matrix Laplace transformations into the calculations of the performance measures. It is shown that these measures are easily carried out on a laptop computer using Microsoft Excel. A simple economic model is used to illustrate how the performance measures may be used to determine optimal economic design specifications for the warm standby.     

�����������������ĸ��ʺ���

??We consider probabilistic meanings for some numerical characteristics of single birth processes. Some probabilities of events, such as extinction probability, returning probability, are represented in terms of these numerical characteristics. Two examples are also presented to illustrate the value of the results.